Fully Automatic Trunk Packing with Free Placements
نویسندگان
چکیده
We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and from combinatorial optimization. It finds better solutions than previous approaches for small trunks.
منابع مشابه
Combinatorial Approaches for the Trunk Packing Problem
In this thesis we consider a three-dimensional packing problem arising in industry. The task is to pack a maximum number of rigid boxes with side length ratios of 4 : 2 : 1 into an irregularly shaped container. Motivated by the structure of manually constructed packings so far, we pursue a discrete approach. We discretize the shape of the container as well as the set of possible box placements....
متن کاملInteractions between foot placement, trunk frontal position, weight-bearing and knee moment asymmetry at seat-off during rising from a chair in healthy controls and persons with hemiparesis.
OBJECTIVE To assess the interaction of foot placement, trunk frontal position, weight-bearing and knee moment asymmetry at seat-off when rising from a chair. DESIGN Cross-sectional study. SUBJECTS Seventeen subjects with hemiparesis and 15 healthy controls. METHODS Trunk position, weight-bearing and knee moment asymmetry were quantified by kinetic and kinematic analysis when the subjects ...
متن کاملOptimal rectangle packing
We consider the NP-complete problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. We present two different constraintsatisfaction formulations of this problem. The first searches a space of absolute placements of rectangles in the enclosing rectangle, while the other searches a space of relative placements between pairs of rectangles. Both appr...
متن کاملTrunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [10] with equally sized boxes [12, 13, 15, 16]. In this paper two discretized approaches for the US standard SAE J1100 [14] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the sp...
متن کاملAn exact algorithm for wirelength optimal placements in VLSI design
We present a new algorithm designed to solve floorplanning problems optimally. More precisely, the algorithm finds solutions to rectangle packing problems which globally minimize wirelength and avoid given sets of blocked regions. We present the first optimal floorplans for 3 of the 5 intensely studied MCNC block packing instances and a significantly larger industrial instance with 27 rectangle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1008.3773 شماره
صفحات -
تاریخ انتشار 2010